A multiattribute GDSS for aiding problem-solving
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولDecision Aiding Ordinal judgments in multiattribute decision analysis
The article discusses the contradiction between the ambiguity of human judgment in a multicriterion environment and the exactness of the assessments required in the majority of the decision-making methods. Preferential information from the decision makers in the ordinal form (e.g., ‘‘more preferable’’, ‘‘less preferable’’, etc.) is argued to be more stable and more reliable than cardinal input....
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملA modified VIM for solving an inverse heat conduction problem
In this paper, we will use a modified variational iteration method (MVIM) for solving an inverse heat conduction problem (IHCP). The approximation of the temperature and the heat flux at are considered. This method is based on the use of Lagrange multipliers for the identification of optimal values of parameters in a functional in Euclidian space. Applying this technique, a rapid convergent s...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2004
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2004.06.014